Quantum superiority for verifying NP-complete problems with linear optics
نویسندگان
چکیده
منابع مشابه
NP-complete problems and Quantum Search
Consider SAT, the prototypical example of an NP-complete problem. An instance of this problem consists of a Boolean function f (x1, . . . ,xn) = c1 ∧ . . .∧ cm; the SAT problem asks you to determine whether there exists a satisfying assignment—that is, an input (a1, . . . ,an) such that f (a1, . . . ,an) = 1. UNIQUE-SAT is a variant of SAT that poses the same problem with the restriction that f...
متن کاملNew quantum algorithm for studying NP-complete problems
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete ...
متن کاملA New Quantum Algorithm for NP-complete Problems
An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine the quantum computer with the chaotic dynamics amplifier based on the logistic map. ∗To be presented at the Third International Conference on “Unconventiona...
متن کاملComplete Problems for Monotone NP
We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...
متن کاملRepeating Patterns in Linear Programs that express NP-Complete Problems
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the minimum required number of linear inequalities, which is most probably exponential to the size of the NP-Complete problem, the Linear Program can still be d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: npj Quantum Information
سال: 2018
ISSN: 2056-6387
DOI: 10.1038/s41534-018-0103-1